Weak Thresholding Greedy Algorithms in Banach Spaces
نویسندگان
چکیده
We consider weak thresholding greedy algorithms with respect to Markushevich bases in general Banach spaces. We find sufficient conditions for the equivalence of boundedness and convergence of the approximants. We also show that if there is a weak thresholding algorithm for the system which gives the best n-term approximation up to a multiplicative constant, then the system is already “greedy”. Similar results are proved for “almost greedy” and “semi-greedy” systems.
منابع مشابه
On the Existence of Almost Greedy Bases in Banach Spaces
We consider several greedy conditions for bases in Banach spaces that arise naturally in the study of the Thresholding Greedy Algorithm (TGA). In particular, we continue the study of almost greedy bases begun in [3]. We show that almost greedy bases are essentially optimal for n-term approximation when the TGA is modified to include a Chebyshev approximation. We prove that if a Banach space X h...
متن کاملLebesgue constants for the weak greedy algorithm
We estimate the Lebesgue constants for the weak thresholding greedy algorithm in a Banach space relative to a biorthogonal system. The estimates involve the weakness (relaxation) parameter of the algorithm, as well as properties of the basis, such as its quasi-greedy constant and democracy function.
متن کاملLebesgue-type Inequalities for Quasi-greedy Bases
We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N term error of approximation times a function of N which depends on the democracy functions and the quasi-greedy constant of the basis. If the basis is democratic this function is bounded by C logN . We show with two examples that this bound is a...
متن کاملComments on the Paper ’on the Existence of Almost Greedy Bases in Banach Spaces’ By
Greedy algorithms are widely used in image processing and other applications. Let X be a real Banach space with a semi-normalized basis (en). An algorithm for n-term approximation produces a sequence of maps Fn : X → X such that, for each x ∈ X, Fn(x) is a linear combination of at most n of the basis elements (ej). Konyagin and Temlyakov [12] introduced the Thresholding Greedy Algorithm (TGA) (...
متن کاملSimultaneous greedy approximation in Banach spaces
We study nonlinear m-term approximation with regard to a redundant dictionary D in a Banach space. It is known that in the case of Hilbert space H the pure greedy algorithm (or, more generally, the weak greedy algorithm) provides for each f ∈ H and any dictionaryD an expansion into a series f = ∞ ∑ j=1 cj (f ) j (f ), j (f ) ∈ D, j = 1, 2, . . . with the Parseval property: ‖f ‖2 = ∑j |cj (f )|2...
متن کامل